Resolution-based Query Answering for Semantic Access to Relational Databases: A Research Note

نویسنده

  • Alexandre Riazanov
چکیده

We address the problem of semantic querying of relational databases (RDB) modulo knowledge bases using very expressive knowledge representation formalisms, such as full first-order logic or its various fragments. We propose to use a first-order logic (FOL) reasoner for computing generic answers to deductive queries, with the subsequent instantiation of these generic answers using a conventional relational DBMS. In this research note, we outline the main idea of this technique – using abstractions of databases and constrained clauses for deriving generic answers. The proposed method can be directly used to enhance the conventional RDB technology. Moreover, we propose it as a potential basis for an efficient Web-scale semantic search technology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ontograte: towards Automatic Integration for Relational Databases and the Semantic Web through an Ontology-Based Framework

Integrating existing relational databases with ontology-based systems is among the important research problems for the Semantic Web. We have designed a comprehensive framework called OntoGrate which combines a highly automatic mapping system, a logic inference engine, and several syntax wrappers that inter-operate with consistent semantics to answer ontology-based queries using the data from he...

متن کامل

Scalable RDF Views of Relational Databases through Partial Evaluation

The semantic web represents meta-data as a triple relation using the RDF data model. We have developed a system to process queries to RDF views of entire relational databases. Optimization of queries to such views is challenging because i) RDF views of entire relational databases become large unions, and ii) queries to the views are more general than relational database queries, making no clear...

متن کامل

OBDA Constraints for Effective Query Answering (Extended Version)

In Ontology Based Data Access (OBDA) users pose SPARQL queries over an ontology that lies on top of relational datasources. These queries are translated on-the-fly into SQL queries by OBDA systems. Standard SPARQL-to-SQL translation techniques in OBDA often produce SQL queries containing redundant joins and unions, even after a number of semantic and structural optimizations. These redundancies...

متن کامل

On the finite controllability of conjunctive query answering in databases under open-world assumption

In this paper we study queries over relational databases with integrity constraints (ICs). The main problem we analyze is OWA query answering, i.e., query answering over a database with ICs under open-world assumption. The kinds of ICs that we consider are inclusion dependencies and functional dependencies, in particular key dependencies; the query languages we consider are conjunctive queries ...

متن کامل

Towards Populating and Querying the Semantic Web

There are two main issues on querying the Semantic Web: what data can be queried and how to query them. This paper tackles how to query existing data in relational databases over popular ontologies in the Semantic Web. It shows (i) how the mappings between Description Logic-based ontologies and relational schemas can be specified, and (ii) how queries against ontologies can be translated to SQL...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0901.0339  شماره 

صفحات  -

تاریخ انتشار 2009